Analysis of dynamic dispatching rules for a flexible manufacturing system

نویسندگان

  • F.T.S. Chan
  • H. K. Chan
چکیده

This paper presents a simulation model of a flexible manufacturing system (FMS) which subjects to minimization three performance criteria simultaneously such as mean flow time, mean tardiness, and mean earliness. The dispatching rule will be changed at a frequency that is varied by the number of outputs produced by the system. Therefore, the dynamic nature is event-triggered rather than changing the rule at a regular time interval, which is passive. Three indexes are calculated to represent the three criteria under monitoring and the indexes are ranked in descending order: the greater the index, the worse is the situation of the criterion in the system. Thus, an appropriate rule will be selected for the next operation in order to tackle that criterion with the largest index. This mechanism is so called pre-emptive method. Furthermore, the indexes can be biased so that particular criterion can have a greater weighting as set by the decision-maker. Results show that a solution (range of frequency) can always be determined to change the dispatching rule so that the system is better than just using fixed FMS scheduling rule. # 2003 Elsevier Science B.V. All rights reserved.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

New scheduling rules for a dynamic flexible flow line problem with sequence-dependent setup times

In the literature, the application of multi-objective dynamic scheduling problem and simple priority rules are widely studied. Although these rules are not efficient enough due to simplicity and lack of general insight, composite dispatching rules have a very suitable performance because they result from experiments. In this paper, a dynamic flexible flow line problem with sequence-dependent se...

متن کامل

A HYBRID GENETIC ALGORITHM FOR A BI-OBJECTIVE SCHEDULING PROBLEM IN A FLEXIBLE MANUFACTURING CELL

 This paper considers a bi-objective scheduling problem in a flexible manufacturing cell (FMC) which minimizes the maximum completion time (i.e., makespan) and maximum tardiness simultaneously. A new mathematical model is considered to reflect all aspect of the manufacturing cell. This type of scheduling problem is known to be NP-hard. To cope with the complexity of such a hard problem, a genet...

متن کامل

Flexible Manufacturing System Scheduling Using Hybrid Petri Nets with Dispatching Rules

Flexible manufacturing systems (FMSs) are advanced and highly integrated manufacturing systems consisting of robots, machining cells, and automated guided vehicles (AGVs) that function under the hierarchical control of computers. The relations between its components are very complex. Scheduling in FMS is an intricate phenomenon owing to the large variability in the operating parameters. Schedul...

متن کامل

Dynamic scheduling of flexible manufacturing systems using neural networks and inductive learning

Dispatching rules are usually applied to schedule jobs in Flexible Manufacturing Systems (FMSs) dynamically. Despite their frequent use, one of the drawbacks that they display is that the state the manufacturing system is in dictates the level of performance of the rule. As no rule is better than all the other rules for all system states, it would highly desirable to know which rule is the most...

متن کامل

Intelligent Scheduling with Machine Learning Capabilities: The Induction of Scheduling Knowledges

Dynamic scheduling of manufacturing systems has primarily involved the use of dispatching rules. In the context of conventional job shops, the relative performance of these rules has been found to depend upon the system attributes, and no single rule is dominant across all possible scenarios. This indicates the need for developing a scheduling approach which adopts a state-dependent dispatching...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2015